Efficient realizations of analysis and synthesis filters based on the 2-D discrete wavelet transform

This paper presents folded architectures and scheduling algorithms for computing the 2-D DWT for analysis and synthesis lters. The folded architectures consist of two parallel computation units (one for computations along the rows and the other for computations along the columns) and two storage units to store the intermediate outputs that are generated by the two units. The scheduling algorithms range from those that try to minimize the latency to those that try to minimize the control unit complexity and keep the data ow regular. A comparison of the scheduling algorithms has been included to aid the designer in choosing an algorithm that is best suited for a particular application.